Message passing for task redistribution on sparse graphs
نویسندگان
چکیده
The problem of resource allocation in sparse graphs with real variables is studied using methods of statistical physics. An efficient distributed algorithm is devised on the basis of insight gained from the analysis and is examined using numerical simulations, showing excellent performance and full agreement with the theoretical results.
منابع مشابه
MMSE denoising of sparse Lévy processes via message passing
Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total-variation (TV) minimization, implicitly assume the signals to be sampled instances of Lévy processes with independent Laplace-distributed incr...
متن کاملA comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors
This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of important scientific algorithms running on data-sets of practical interest. The annotation which assigns weights to nodes and edges of the task-graphs is realistic It reflects cu...
متن کاملAutomatic Multithreaded Parallel Program Generation for Message Passing Multiprocessors Using Parameterized Task Graphs
متن کامل
A Comparison Study of Heuristics for Mapping Parallel Algorithms to Message-passing Multiprocessors
This paper presents a comparison study of popular clustering and mapping heuristics which are used to map taskow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of important scienti c algorithms running on data-sets of practical interest. The annotation which assigns weights to nodes and edges of the task-graphs is realistic. It re ects curren...
متن کاملContagion in an interacting economy
We investigate the credit risk model defined in Hatchett and Kühn [18] under more general assumptions, in particular using a general degree distribution for sparse graphs. Expanding upon earlier results, we show that the model is exactly solvable in the N →∞ limit and demonstrate that the exact solution is described by the message-passing approach outlined in Karrer and Newman [21], generalized...
متن کامل